Initial number of Lucas’ type series for the generalized Fibonacci sequence

نویسندگان

چکیده

Initial numbers for Lucas? type series have so far been established only Fibonacci (2,1) and Tribonacci (3,1,3) sequences. Characteristics of stated is their asymptotic relation with the exponent constant. By using a simple procedure based on relations exponents sequences constant application Nearest Integer Function - NIF, general rule initial Generalized sequence has established, first time. All gained are integers, number always equal to order Fn(0) = n remaining functionally dependent Fn(k) 2k-1-1. This premiere presentation Prim-nacci sequence, too. Determinants generalized proven factorial function.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On convolved generalized Fibonacci and Lucas polynomials

We define the convolved hðxÞ-Fibonacci polynomials as an extension of the classical con-volved Fibonacci numbers. Then we give some combinatorial formulas involving the hðxÞ-Fibonacci and hðxÞ-Lucas polynomials. Moreover we obtain the convolved hðxÞ-Fibo-nacci polynomials from a family of Hessenberg matrices. Fibonacci numbers and their generalizations have many interesting properties and appli...

متن کامل

Some Identities for Generalized Fibonacci and Lucas Sequences

In this study, we define a generalization of Lucas sequence {pn}. Then we obtain Binet formula of sequence {pn} . Also, we investigate relationships between generalized Fibonacci and Lucas sequences.

متن کامل

The degree sequence of Fibonacci and Lucas cubes

The Fibonacci cube Γn is the subgraph of the n-cube induced by the binary strings that contain no two consecutive 1’s. The Lucas cube Λn is obtained from Γn by removing vertices that start and end with 1. It is proved that the number of vertices of degree k in Γn and Λn is ∑k i=0 ( n−2i k−i )( i+1 n−k−i+1 ) and ∑k i=0 [ 2 ( i 2i+k−n )( n−2i−1 k−i ) + ( i−1 2i+k−n )( n−2i k−i )] , respectively. ...

متن کامل

ON THE GENERALIZED ORDER-k FIBONACCI AND LUCAS NUMBERS

In this paper we consider the generalized order-k Fibonacci and Lucas numbers. We give the generalized Binet formula, combinatorial representation and some relations involving the generalized order-k Fibonacci and Lucas numbers.

متن کامل

Sums of products of generalized Fibonacci and Lucas numbers

In this paper, we establish several formulae for sums and alternating sums of products of generalized Fibonacci and Lucas numbers. In particular, we recover and extend all results of Z. Čerin [2, 2005] and Z. Čerin and G. M. Gianella [3, 2006], more easily.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Filomat

سال: 2021

ISSN: ['2406-0933', '0354-5180']

DOI: https://doi.org/10.2298/fil2111891c